Ranking for BioMinT: Investigating Performance, Local Search and Homonymy Recognition
نویسنده
چکیده
In this paper we investigate several hypotheses concerning document relevance ranking for biological literature. More specifically, we focus on three topics: performance, risk of local searching, and homonymy recognition. Surprisingly, we find that a simple ranker based on the occurrence of a single word performs best. Adding this word as a new search term to each query yields even better results. The risk of local searching, i.e. retrieving documents by query followed by local indexing vs. maintaining a local repository and index of the full MEDLINE database, is found to be negligible – contrary to intuition, the latter approach even performs worse on some queries. The removal of automatically determined homonyms yields almost indistinguishable results to the original query, so it is not inconceivable that the problem of homonymy in biological literature has been overstated. Concluding, our work shows that simple rankers may be competitive to vastly more complex ensemble systems which include biological background knowledge and part-of-speech tagging which have been previously applied to task. The result reconfirms common wisdom within this research field.
منابع مشابه
A New Hybrid Method for Web Pages Ranking in Search Engines
There are many algorithms for optimizing the search engine results, ranking takes place according to one or more parameters such as; Backward Links, Forward Links, Content, click through rate and etc. The quality and performance of these algorithms depend on the listed parameters. The ranking is one of the most important components of the search engine that represents the degree of the vitality...
متن کاملبررسی مجموعه آزمونهای عصب- روانشناختی در تشخیص رانندگان اتوبوس بین شهری متخلف و شایسته
AbstractObjectives: This study has been carried out with the aim of investigating motor, cognitive and executive functions of a group of accident-prone drivers. Method: Seventy professional accident-prone drivers with major faults and 30 drivers recognized as good and safe drivers, were examined using tests that assessed reaction time, recognition, memory, attention and concentration, as well a...
متن کاملInvestigating Zone Pricing in a Location-Routing Problem Using a Variable Neighborhood Search Algorithm
In this paper, we assume a firm tries to determine the optimal price, vehicle route and location of the depot in each zone to maximise its profit. Therefore, in this paper zone pricing is studied which contributes to the literature of location-routing problems (LRP). Zone pricing is one of the most important pricing policies that are prevalently used by many companies. The proposed problem is v...
متن کاملDisguised Face Recognition by Using Local Phase Quantization and Singular Value Decomposition
Disguised face recognition is a major challenge in the field of face recognition which has been taken less attention. Therefore, in this paper a disguised face recognition algorithm based on Local Phase Quantization (LPQ) method and Singular Value Decomposition (SVD) is presented which deals with two main challenges. The first challenge is when an individual intentionally alters the appearance ...
متن کاملHybrid Probabilistic Search Methods for Simulation Optimization
Discrete-event simulation based optimization is the process of finding the optimum design of a stochastic system when the performance measure(s) could only be estimated via simulation. Randomness in simulation outputs often challenges the correct selection of the optimum. We propose an algorithm that merges Ranking and Selection procedures with a large class of random search methods for continu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004